Pareto Surface ' S of Complexity
نویسنده
چکیده
I. Pireto surfaces and attainable sets of complexity 1 (i.e., those having a l-coiumodi*/ representation and no O-comcodity representation) are treated. An implicit characterization of these sets is given, and various of their properties are derived. In particular, Pareto surfaces of complexity a^ raost 1 are always closed ses.
منابع مشابه
A Collaborative Stochastic Closed-loop Supply Chain Network Design for Tire Industry
Recent papers in the concept of Supply Chain Network Design (SCND) have seen a rapid development in applying the stochastic models to get closer to real-world applications. Regaring the special characteristics of each product, the stracture of SCND varies. In tire industry, the recycling and remanufacturing of scraped tires lead to design a closed-loop supply chain. This paper proposes a two-st...
متن کاملThe Multidisciplinary Design Optimization of a Reentry Vehicle Using Parallel Genetic Algorithms
The purpose of this paper is to examine the multidisciplinary design optimization (MDO) of a reentry vehicle. In this paper, optimization of a RV based on, minimization of heat flux integral and minimization of axial force coefficient integral and maximization of static margin integral along reentry trajectory is carried out. The classic optimization methods are not applicable here due to the c...
متن کاملAn effective method based on the angular constraint to detect Pareto points in bi-criteria optimization problems
The most important issue in multi-objective optimization problems is to determine the Pareto points along the Pareto frontier. If the optimization problem involves multiple conflicting objectives, the results obtained from the Pareto-optimality will have the trade-off solutions that shaping the Pareto frontier. Each of these solutions lies at the boundary of the Pareto frontier, such that the i...
متن کاملAn algorithm for multi-objective job shop scheduling problem
Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...
متن کاملA Neural Network Based Generalized Response Surface Multiobjective Evolutionary Algorithm
The practical use of multiobjective optimization tools in industry is still an open issue. A strategy for reduction of objective function calls is often essential, at a fixed degree of Pareto Optimal Front (POF) approximation accuracy . To this aim an extension of single-objective NN-based GRS methods to Pareto Optimal Front (POF) approximation is proposed. Such an extension is not at all strai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015